#include"BinaryTreeNode.h"
void test1()
{
	char arr1[20] = "ABD##E#H##CF##G##";
	char arr2[30] = "ABDZ##X##EC##H##CF##G##";
	int i = 0;
	BTNode* BT=BinaryTreeCreate(arr2, 17, &i);
	BinaryTreePrevOrder(BT);
	printf("\n");
	BinaryTreeInOrder(BT);
	printf("\n");
	BinaryTreePostOrder(BT);
	printf("\n");
	printf("%d\n", BinaryTreeSize(BT));
	printf("%d\n", BinaryTreeLeafSize(BT));
	BTNode* BT1 = BinaryTreeFind(BT, 'h');
	printf("%d\n", BinaryTreeLevelKSize(BT, 4));
	BinaryTreeLevelOrder(BT);
	printf("%d",BinaryTreeComplete(BT));
	BinaryTreeDestory(&BT);
}
int main()
{
	test1();
	return 0;
}